CSCI4011: Formal Languages and Automata Theory

4 Credits

Logical/mathematical foundations of computer science. Formal languages, their correspondence to machine models. Lexical analysis, string matching, parsing. Decidability, undecidability, limits of computability. Computational complexity. prereq: 2041 or instr consent

View on University Catalog

All Instructors

B Average (3.128)Most Common: A (17%)

This total also includes data from semesters with unknown instructors.

1660 students
SNWFDCBA
  • 4.22

    /6

    Recommend
  • 4.51

    /6

    Effort
  • 4.92

    /6

    Understanding
  • 4.21

    /6

    Interesting
  • 4.63

    /6

    Activities


      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Summer 2025 provided by the University in response to a public records request

      Not affiliated with the University of Minnesota

      Privacy Policy